Wendland functions with increasing smoothness converge to a Gaussian
نویسندگان
چکیده
منابع مشابه
The missing Wendland functions
and leave out the integer order spaces in even dimensions. We derive the missing Wendland functions working for half–integer k and even dimensions, reproducing integer–order Sobolev spaces in even dimensions, but they turn out to have two additional non–polynomial terms: a logarithm and a square root. To give these functions a solid mathematical foundation, a generalized version of the “dimensi...
متن کاملWendland Functions - A C++ Code to Compute Them
In this paper we present a code in C++ to compute Wendland functions for arbitrary smoothness parameters. Wendland functions are compactly supported Radial Basis Functions that are used for interpolation of data or solving Partial Differential Equations with mesh-free collocation. For the computations of Lyapunov functions using Wendland functions their derivatives are also needed so we include...
متن کاملTractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithmically increasing smoothness. This is demonstrated for the approximation problem defined over Korobov spaces and for the approximation problem of certain diagonal operators. For these two problems we show necessary and...
متن کاملHexagonal Smoothness-Increasing Accuracy-Conserving Filtering
DiscontinuousGalerkin (DG)methods are a popular class of numerical techniques to solve partial differential equations due to their higher order of accuracy. However, the interelement discontinuity of a DG solution hinders its utility in various applications, including visualization and feature extraction. This shortcoming can be alleviated by postprocessing of DG solutions to increase the inter...
متن کاملSmoothness of Multiple Refinable Functions
We consider the smoothness of solutions of a system of refinement equations written in the form φ = ∑ α∈Z a(α)φ(2 · − α), where the vector of functions φ = (φ1, . . . , φr) is in (Lp(R)) and a is a finitely supported sequence of r× r matrices called the refinement mask. We use the generalized Lipschitz space Lip∗(ν, Lp(R)), ν > 0, to measure smoothness of a given function. Our method is to rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2013
ISSN: 1019-7168,1572-9044
DOI: 10.1007/s10444-013-9304-5